def insertionsort(sortlist):
  i=1
  if len(sortlist)==1:
    return(sortlist)
  else:
    while i<len(sortlist):
      j=0
      while (sortlist[j]<=sortlist[i]) and (j<i):
	j=j+1
      u=sortlist[i]
      sortlist.pop(i)	
      sortlist.insert(j,u)
      i=i+1
    return(sortlist)  
